Continued fractions and the Markoff tree

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nested Intervals Tree Encoding with Continued Fractions

Tree encodings methods themselves can be split into 2 groups: • Materialized Path • Nested Sets Materialized Path is nearly ubiquitous encoding, where each tree node is labeled with the path from the node to the root. UNIX global filenames is well known showcase for this idea. Materialized path could be either represented as character string of unique sibling identifiers (concatenated with some...

متن کامل

Periodic Continued Fractions And

We investigate when an algebraic function of the form φ(λ) = −B(λ)+ √ R(λ) A(λ) , where R(λ) is a polynomial of odd degree N = 2g + 1 with coefficients in C, can be written as a periodic α-fraction of the form

متن کامل

Continued Fractions and Gaps

Given a continued fraction, we construct a certain function that is discontinuous at every rational number p/q. We call this discontinuity the “gap”. We then try to characterize the gap sizes, and find, to the first order, the size is 1/q2, and that, for higher orders, the gap appears to be perfectly ’randomly’ distributed, in that it is Cauchy-dense on the unit square, and thus, this function ...

متن کامل

Generalized Continued Logarithms and Related Continued Fractions

We study continued logarithms as introduced by Bill Gosper and studied by J. Borwein et. al.. After providing an overview of the type I and type II generalizations of binary continued logarithms introduced by Borwein et. al., we focus on a new generalization to an arbitrary integer base b. We show that all of our so-called type III continued logarithms converge and all rational numbers have fin...

متن کامل

Exponential and Continued Fractions

The continued fraction expansion of a real number is a fundamental and revealing expansion through its connection with Euclidean algorithm and with ``best'' rational approximations (see [HW]). At the same time, it is very poorly understood for some interesting numbers. We know that it is essentially unique and finite (i.e., terminating) exactly for rational numbers and periodic exactly for quad...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expositiones Mathematicae

سال: 2007

ISSN: 0723-0869

DOI: 10.1016/j.exmath.2006.10.002